On the Hamming bound for nonbinary localized-error-correcting codes
نویسندگان
چکیده
For nonbinary codes it is proved that the Hamming bound is asymptotically sharp in some range of the code rate.
منابع مشابه
Perfect codes and related topics
The topic of perfect codes is one of the most important topics in the theory of error-correcting codes. The class of perfect codes is very complicated, large (double exponential) and intensively studied by many researches. The investigation of nontrivial properties of perfect codes is significant both from coding point of view (for the solution of the classification problem for such codes) and ...
متن کاملA Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k = n − j − 2 qubits in n = 2j qubits and correct t = 1 error. 89.80.+h, 03.65.-w Typeset using REVTEX [email protected] 1
متن کاملEstimates of the distance distribution of nonbinary codes, with applications
We use the polynomial method to derive upper and lower bounds on the distance distribution of nonbinary codes in the Hamming space. Applications of the bounds include a better asymptotic upper bound on the weight distribution of Goppa codes from maximal curves, a new upper bound on the size of a q-ary code with a given rth generalized weight, improved estimates of the size of secant spaces of a...
متن کاملConstruction of [[n,n − 4,3]]q quantum codes for odd prime power q
The theory of quantum error-correcting codes (QECCs, for short) has been exhaustively studied in the literature; see [1–8]. The most widely studied class of quantum codes are binary quantum stabilizer codes. A thorough discussion on the principles of quantum coding theory was given in [3] and [4] for binary quantum stabilizer codes. An appealing aspect of binary quantum codes is that there exis...
متن کاملNonbinary quantum error-correcting codes from algebraic curves
We give a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes from algebraic curves. We also give asymptotically good nonbinary quantum codes from a GarciaStichtenoth tower of function fields which are constructible in polynomial time. keywords Algebraic geometric codes, nonbinary quantum codes.
متن کامل